3D Visual Comfort Assessment via Sparse Coding

نویسندگان

  • Qiuping Jiang
  • Feng Shao
چکیده

The issue of visual discomfort has long been restricting the develop‐ ment of advanced stereoscopic 3D video technology. Bolstered by the require‐ ment of highly comfortable three-dimensional (3D) content service, predicting the degree of visual comfort automatically with high accuracy has become a topic of intense study. This paper presents a novel visual comfort assessment (VCA) metric based on sparse coding strategy. The proposed VCA metric comprises three stages: feature representation, dictionary construction, sparse coding, and pooling strategy, respectively. In the feature representation stage, visual saliency labeled disparity statistics and neural activities are computed to capture the overall degree of visual comfort for a certain stereoscopic image. A set of stereoscopic images with a wide range degree of visual comfort are selected to construct dictionary for sparse coding. Given an input stereoscopic image, by representing features in the constructed dictionary via sparse coding algorithm, the corre‐ sponding visual comfort score can be estimated by weighting mean opinion scores (MOSs) using the sparse coding coefficients. In addition, we conduct a new 3D image benchmark database for performance validation. Experimental results on this database demonstrate that the proposed metric outperforms some represen‐ tative VCA metrics in the regard of consisting with human subjective judgment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

Self-learning-based post-processing for image/video deblocking via sparse representation

Blocking artifact, characterized by visually noticeable changes in pixel values along block boundaries, is a common problem in block-based image/video compression, especially at low bitrate coding. Various post-processing techniques have been proposed to reduce blocking artifacts, but they usually introduce excessive blurring or ringing effects. This paper proposes a self-learning-based post-pr...

متن کامل

Face Recognition using an Affine Sparse Coding approach

Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...

متن کامل

Subspace Clustering via Graph Regularized Sparse Coding

Sparse coding has gained popularity and interest due to the benefits of dealing with sparse data, mainly space and time efficiencies. It presents itself as an optimization problem with penalties to ensure sparsity. While this approach has been studied in the literature, it has rarely been explored within the confines of clustering data. It is our belief that graph-regularized sparse coding can ...

متن کامل

Non-negative matrix factorization for visual coding

This paper combines linear sparse coding and nonnegative matrix factorization into sparse non-negative matrix factorization. In contrast to non-negative matrix factorization, the new model can leam much sparser representation via imposing sparseness constraints explicitly; in contrast to a close model non-negative sparse coding, the new model can learn parts-based representation via fully multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015